Ambient Graph Rewriting
نویسندگان
چکیده
We investigate synchronized hyperedge replacement (SHR) as general framework for distributed programming and system design. We propose a slender version of SHR which dramaticaly reduces the mathematical overhead of the original proposal [5] and use it to interpret the distributed CCS [7] and the calculus of Mobile Ambients [1] in a uniform semantic framework. The encodings are bisimulations. A tool for supporting distributed system design and analysis is presented. The tool, which adopts the slender SHR as intermediate language, integrates model checking techniques within the framework of (distributed) program development.
منابع مشابه
Encoding Distributed Process Calculi into LMNtal
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced “elemental”), a model and language based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. Diverse computational models including the π-calculus and the λ-calculus have been encoded into LMNtal and tested on our LMNtal system. Thi...
متن کاملUsing Graph-Rewriting for Model Weaving in the context of Aspect-Oriented Product Line Engineering
In this paper we present the concept of combining feature models and solution models through aspect-oriented graph rewriting systems (AO-GRS) in the context of product-line engineering (PLE). Variable parts of software systems are often modelled by feature models in PLE. In Model Driven Development a feature is represented by means of model elements in a solution model, e.g. classes, methods or...
متن کاملA Graph Semantics for a Variant of the Ambient Calculus more Adequate for Modeling SOC
In this paper we present a graph semantics of a variant of the well known ambient calculus. The main change of our variant is to extract the mobility commands of the original calculus from the ambient topology. Similar to a previous work of ours, we prove that our encoding have good properties. We strongly believe that this variant would allow us to integrate our graph semantics of our mobile c...
متن کاملA Graph Semantics for a Variant of the Ambient Calculus More Adequate for Modeling Service Oriented Computing
In this paper we present a graph semantics of a variant of the well known ambient calculus. The main change of our variant is to extract the mobility commands of the original calculus from the ambient topology. Similar to a previous work of ours, we prove that our encoding has good properties. We strongly believe that this variant would allow us to integrate our graph semantics of our mobile ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 117 شماره
صفحات -
تاریخ انتشار 2005